Quasi-optimal observables vs. event selection cuts
نویسندگان
چکیده
منابع مشابه
Quasi-optimal observables: Attaining the quality of maximal likelihood in parameter estimation when only a MC event generator is available
In this lecture, I’d like to explain a recent finding [1] which connects the two basic methods of parameter estimation, the method of maximal likelihood and the method of generalized moments (see e.g. [2]). The two methods (along with the χ method, which I won’t discuss) are very well known and widely used in experimental physics. In a sense, the connection views the method of maximal likelihoo...
متن کاملOptimal Portfolio Selection with Transaction Costs and “ Event Risk ” ∗
In this paper we consider the optimal trading strategy for an investor with an exponentially distributed horizon who invests in a riskless asset and a risky asset. The risky asset is subject to proportional transaction costs and its price follows a jump diffusion. In this situation, the optimal trading strategy is to maintain the fraction of the dollar amount invested in the riskless asset to t...
متن کاملTesting for Adverse Selection with “Unused Observables”
This paper proposes a new test for adverse selection in insurance markets based on observable characteristics of insurance buyers that are not used in setting insurance prices. The test rejects the null hypothesis of symmetric information when it is possible to find one or more such “unused observables” that are correlated both with the claims experience of the insured and with the quantity of ...
متن کاملOptimal Quantum Feedback Control for Canonical Observables
We show that the stochastic Schrödinger equation for the filtered state of a system, with linear free dynamics, undergoing continual nondemolition measurement or either position or momentum, or both together, can be solved explicitly within a class of Gaussian states which we call extended coherent states. The asymptotic limit yields a class of relaxed states which we describe explicitly. Bellm...
متن کاملFinding k-cuts within Twice the Optimal
Two simple approximation algorithms for the minimum k-cut problem are presented. Each algorithm finds a k cut having weight within a factor of (2 2/k) of the optimal. One algorithm is particularly efficient-it requires a total of only n maximum flow computations for finding a set of near-optimal k cuts, one for each value of k between 2 and n.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment
سال: 2003
ISSN: 0168-9002
DOI: 10.1016/s0168-9002(03)00573-4